visibility algorithm

visibility algorithm
алгоритм разделения видимых и невидимых элементов сцены

Англо-русский словарь промышленной и научной лексики. 2014.

Игры ⚽ Нужна курсовая?

Смотреть что такое "visibility algorithm" в других словарях:

  • Painter's algorithm — The painter s algorithm, also known as a priority fill, is one of the simplest solutions to the visibility problem in 3D computer graphics. When projecting a 3D scene onto a 2D plane, it is necessary at some point to decide which polygons are… …   Wikipedia

  • Kuwaiti algorithm — Microsoft uses the Kuwaiti algorithm to convert between dates in the Western standard Gregorian calendar and dates in the Hijri or Islamic calendar. There is no fixed correspondence defined in advance between the Gregorian solar calendar and the… …   Wikipedia

  • Emergent algorithm — An emergent algorithm is an algorithm that has the following characteristics:* it achieves predictable global effects * it does not require global visibility * it does not assume any kind of centralized control * it is self stabilizing See also * …   Wikipedia

  • Genesis3D — was a project by Eclipse Entertainment to create a real time 3D engine for Microsoft Windows. It was released as source code in 1998. The first released version supported hardware acceleration and a software renderer. Genesis3D had RGB lightmaps …   Wikipedia

  • Potentially visible set — Potentially Visible Sets are used to accelerate the rendering of 3D environments. This is a form of occlusion culling, whereby a candidate set of potentially visible polygons are pre computed, then indexed at run time in order to quickly obtain… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

  • Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

  • Hidden surface determination — In 3D computer graphics, hidden surface determination (also known as hidden surface removal (HSR), occlusion culling (OC) or visible surface determination (VSD)) is the process used to determine which surfaces and parts of surfaces are not… …   Wikipedia

  • List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… …   Wikipedia

  • Motion planning — (a.k.a., the navigation problem , the piano mover s problem ) is a term used in robotics for the process of detailing a task into discrete motions. For example, consider navigating a mobile robot inside a building to a distant waypoint. It should …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»